#include <cstdio>
#include <algorithm>

using namespace std;

struct Node
{
    int num;
    float total;
};

bool operator < ( Node a, Node b )
{
    if ( a.total == b.total )
        return a.num < b.num;
    return a.total > b.total;
}

int main( )
{
    Node s[ 1000 ];
    int n, m, k, i, j, num[ 1000 ];
    float t;
    while ( scanf("%d%d%d", &n, &m, &k) != EOF )
    {
        for ( i = 0; i < m; i++ )
        {
            s[ i ].num = i + 1;
            s[ i ].total = 0;
        }
        for ( i = 0; i < n; i++ )
            for ( j = 0; j < m; j++ )
            {
                scanf("%f", &t);
                s[ j ].total += t;
            }
        sort( s, s + m );
        for ( i = 0; i < k; i++ )
            num[ i ] = s[ i ].num;
        sort( num, num + k );
        printf("%d", num[ k - 1 ]);
        for ( i = k - 2; i >= 0; i-- )
            printf(" %d", num[ i ]);
        printf("\n");
    }
    return 0;
}
